Lecture Notes on an FPRAS for #KNAPSACK

Lecture Notes on an FPRAS for Network Unreliability

Smartphones and Our Students:A Case of Undergraduate Students in an EFL Context

Immoderate smart phone usage usually makes the students addicted to it and spends less time reading lecture notes and textbooks. This study aims to determine university students' usage of smart phones and perceived rejection of paper books in an EFL context. The study collected data through a 20-item structured questionnaire consisting of the general characteristics, the number and hours of gen...

Factors affecting students tendency of Univercity students to Lecture Notes

Introduction: Many studies detected factors contributing to the students’ tendency to lecture notes. This study aimed at evaluating the factors affecting students tendency to lecture notes in Hormozgan University of Medical Sciences. Methods: In this descriptive study, 179 students from medicine, nursing & midwifery, health, and Paramedicine schools were selected through stratified random...

The Lasserre hierarchy in Approximation algorithms

The Lasserre hierarchy is a systematic procedure to strengthen a relaxation for an optimization problem by adding additional variables and SDP constraints. In the last years this hierarchy moved into the focus of researchers in approximation algorithms as the obtain relaxations have provably nice properties. In particular on the t-th level, the relaxation can be solved in time n ) and every con...

Lecture 11 — 24 March, 2014: ``11. Rank lower bound for knapsack.''

Constraints fi enforce that variables take 0-1 values. Hence, it follows that the constraints are satisfiable if r is an integer between 0 and n, and unsatisfiable if r is outside of that range or non-integral. The latter case of non-integral r is the one we focus on in this lecture. The lecture is based on the paper by Grigoriev, which builds on a result by Impagliazzo, Pudlák, and Sgall 1. Fo...